package com.leetcode;

public class L0198 {
    public int rob(int[] nums) {
        int len=nums.length;
        if(len==1)
            return nums[0];
        int[] dp=new int[len];
        dp[0]=nums[0];
        dp[1]=Math.max(nums[0],nums[1]);
        for (int i=2;i<len;i++){
            if (nums[i]+dp[i-2]>dp[i-1]){
                dp[i]=nums[i]+dp[i-2];
            }else {
                dp[i]=dp[i-1];
            }
        }
        return Math.max(dp[len-1],dp[len-2]);
    }
}
